Modifications on Character Sequences and Construction of Large Even Length Binary Sequences
نویسندگان
چکیده
It has been noticed that all the known binary sequences having the asymptotic merit factor ≥ 6 are the modifications to the real primitive characters. In this paper, we give a new modification of the character sequences at length N = p1p2 . . . pr, where pi’s are distinct odd primes and r is finite. Based on these new modifications, for N = p1p2 . . . pr with pi’s distinct odd primes, we can construct a binary sequence of length 2N with asymptotic merit factor 6.0.
منابع مشابه
Extended Binary Linear Codes from Legendre Sequences
A construction based on Legendre sequences is presented for a doubly-extended binary linear code of length 2p + 2 and dimension p+1. This code has a double circulant structure. For p = 4k +3, we obtain a doubly-even self-dual code. Another construction is given for a class of triply extended rate 1/3 codes of length 3p + 3 and dimension p + 1. For p = 4k + 1, these codes are doubly-even selfort...
متن کاملImprovement of Long Binary Sequence Merit Factors using Modified Legendre Algorithms
Low autocorrelation binary sequence (LABS) detection is a classic problem in the literature. We use these sequences in many real-life applications. The detection of these sequences involves many problems. In the literature, various methods have been developed to approach the LABS issue. Based on the length of the sequence, an appropriate method can be selected and implemented. For short length ...
متن کاملA Modified Jacobi Sequence Construction Using Multi-Rate Legendre Sequences
This paper investigates the generation of a binary Modified Jacobi sequence by means of an additive combination of constituent binary Legendre sequences which are clocked at different rates. These multi-rate combinations demonstrate that sequences of large linear complexity can be generated without resorting to linear feedback shift registers (LFSRs) of large length. Results on the linear compl...
متن کاملA construction of binary Golay sequence pairs from odd-length Barker sequences
Binary Golay sequence pairs exist for lengths 2, 10 and 26 and, by Turyn’s product construction, for all lengths of the form 21026 where a, b, c are non-negative integers. Computer search has shown that all inequivalent binary Golay sequence pairs of length less than 100 can be constructed from five “seed” pairs, of length 2, 10, 10, 20 and 26. We give the first complete explanation of the orig...
متن کاملA Mapping From Length n Binary Linear Block Codes to Length 2 Bipolar Bent and Almost Bent Sequences
It is shown how a half-rate length n binary linear block code can always be used to generate a pair of bipolar Bent sequences of length 2n, for n even. The technique uses the length 2n Walsh-Hadamard Transform in conjunction with multidimensional cyclic shifts and multidimensional phase shifts. The technique is also used to generate Almost Bent sequences when n is odd. Note: This paper remains ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1407.3178 شماره
صفحات -
تاریخ انتشار 2014